The Canonicity of Point-free Topology
نویسندگان
چکیده
Properties of topological spaces are not absolute, as they may depend on the ambient mathematical universe. For instance, the answers to some questions in classical point-set topology hinge on non-standard set-theoretic axioms, while in intuitionistic mathematics even such basic properties as the Heine-Borel compactness of the closed interval depend on the ambient constructive variety. We show that, in contrast, there is a robust and natural formulation of point-free topology: the category of countably presented topologies (or locales, or formal spaces) is determined up to equivalence by the number-theoretic functions of the ambient framework. As most varieties of constructive mathematics agree that such functions are the Turing computable ones, they all have the same notion of countably-presented point-free spaces. (This talk presents joint work with Alex Simpson, University of Ljubljana.) A spatiality-like property for pointfree topologies with a positivity relation Francesco Ciraulo University of Padova It is an unchangeable fact of history that pointfree topology appeared after pointwise one. For this reason the former is “condemned” to compare itself with the latter and, in particular, to consider the case of spatial topologies as a notable case. I will talk about one of the constructive manifestations of the classical notion of spatiality. This has recently been isolated by Sambin [4], who gave it the name of reducibility. It was then studied in [1], of which I will present some results. Here are two examples: reducibility for the pointfree version of Cantor space amounts to the Weak König’s Lemma; reducibility for the pointfree Baire space states that every element of a (not necessarily decidable) spread belongs to a choice sequence contained in that spread [3]. In general, reducibility is a point existence property. Reducibility was born in the more general context of formal topologies with a positivity relation, also called positive topologies, where it emerged for structural motivations and reasons of symmetry. In [2] we managed to give a “localic” description of the category of positive topologies; in view of that work, reducibility can be now understood as statement about the weakly closed sublocales of the given locale. Classically, reducibility is equivalent to spatiality, at least in the particular case of locales; and assuming either spatiality implies reducibility or the converse yields the full law of excluded middle. In the more general case of positive topologies, instead, even if classical logic is assumed, reducibility remains distinct from, actually weaker than, spatiality. This makes the notion of reducibility potentially interesting also to a classical mathematician.
منابع مشابه
$LG$-topology
In this paper, we introduce a new model of point free topology for point-set topology. We study the basic concepts in this structure and will find that it is naturally close to point-set topology.
متن کاملCritical fixed point theorems in Banach algebras under weak topology features
In this paper, we establish some new critical fixed point theorems for the sum $AB+C$ in a Banach algebra relative to the weak topology, where $frac{I-C}{A}$ allows to be noninvertible. In addition, a special class of Banach algebras will be considered.
متن کاملSOME FIXED POINT THEOREMS IN LOCALLY CONVEX TOPOLOGY GENERATED BY FUZZY N-NORMED SPACES
The main purpose of this paper is to study the existence of afixed point in locally convex topology generated by fuzzy n-normed spaces.We prove our main results, a fixed point theorem for a self mapping and acommon xed point theorem for a pair of weakly compatible mappings inlocally convex topology generated by fuzzy n-normed spaces. Also we givesome remarks in locally convex topology generate...
متن کاملCanonicity Effect on Sentence Processing of Persian-speaking Broca’s Patients
Introduction: Fundamental notions of mapping hypothesis and canonicity were scrutinized in Persian-speaking aphasics. Methods: To this end, the performance of four age-, education-, and gender matched Persian-speaking Broca's patients and eight matched healthy controls in diverse complex structures were compared via the conduction of two tasks of syntactic comprehension and grammaticality jud...
متن کاملCanonicity results for mu-calculi: an algorithmic approach
We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward. In the algebraic setting of canonical extensions we examine both the usual notion of canonicity and what we will call tame canonicity. This latter concept has previously been investigated for the classical mu-calculus...
متن کاملCanonicity and bi-approximation in non-classical logics
Non-classical logics, or variants of non-classical logics, have rapidly been developed together with the progress of computer science since the 20th century. Typically, we have found that many variants of non-classical logics are represented as ordered algebraic structures, more precisely as lattice expansions. From this point of view, we can think about the study of ordered algebraic structure...
متن کامل